Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory
نویسنده
چکیده
The aim of this workshop was to bring together experts and students from pure and applied mathematics, computer science, and engineering, who are working on related problems in the areas of matroid theory, combinatorial optimization, coding theory, secret sharing, network coding, and information inequalities. The goal was to foster exchange of mathematical ideas and tools that can help tackle some of the open problems of central importance in coding theory, secret sharing, and network coding, and at the same time, to get pure mathematicians and computer scientists to be interested in the kind of problems that arise in these applied fields.
منابع مشابه
Hodge Theory for Combinatorial Geometries
The matroid is called loopless if the empty subset of E is closed, and is called a combinatorial geometry if in addition all single element subsets of E are closed. A closed subset of E is called a flat of M, and every subset of E has a well-defined rank and corank in the poset of all flats of M. The notion of matroid played a fundamental role in graph theory, coding theory, combinatorial optim...
متن کاملCombinatorial Optimization in Computational Biology
Combinatorial Optimization is a central sub-area in Operations Research that has found many applications in computational biology. In this talk I will survey some of my research in computational biology that uses graph theory, matroid theory, and integer linear programming. The biological applications come from haplotyping, the study of recombination and recombination networks, and phylogenetic...
متن کاملWhat is a matroid? Theory and Applications, from the ground up
Gian-Carlo Rota said that “Anyone who has worked with matroids has come away with the conviction that matroids are one of the richest and most useful ideas of our day.” [20] Hassler Whitney introduced the theory of matroids in 1935 and developed a striking number of their basic properties as well as different ways to formulate the notion of a matroid. As more and more connections between matroi...
متن کاملRandom Sampling and Greedy Sparsiication for Matroid Optimization Problems
Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the eeectiveness of these paradigms for two optimization problems on matroids: nding an optimum matroid basis and packing disjoint matroid bases. Applications of th...
متن کاملRandom sampling and greedy sparsification for matroid optimization problems
Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the eeectiveness of these paradigms for two optimization problems on matroids: nding an optimum matroid basis and packing disjoint matroid bases. Applications of th...
متن کامل